Flow formulations for the Time Window Assignment Vehicle Routing Problem
نویسندگان
چکیده
In this thesis, we consider ow formulations for the Time Window Assignment Vehicle Routing Problem (TWAVRP), the problem of assigning time windows for delivery before demand volume becomes known. Using commercial solver CPLEX as a basis, we develop a branch-and-cut algorithm that is able to solve all test-instances of Spliet and Gabor (2014) to optimality and is highly competitive with the state of the art solution methods. Furthermore, we introduce a novel set of TWAVRP speci c valid inequalities, the precedence inequalities, and show that applying them yields a competitive algorithm as well.
منابع مشابه
A Quantum Evolutionary Algorithm for the Vehicle Routing Problem with Single-sided Time Window Setting
Customer service level is of prime importance in today competitive world and has various dimensions with delivery quality being one of the most important ones. Delivery quality has several parameters such as deliver time window options, time window size, etc. In this paper we focus on one of these parameters, namely time window setting. It has a direct impact upon customer satisfaction and busi...
متن کاملAn Improved Hybrid Cuckoo Search Algorithm for Vehicle Routing Problem with Time Windows
Transportation in economic systems such as services, production and distribution enjoys a special and important position and provides a significant portion of the country's gross domestic product. Improvements in transportation system mean improvements in the traveling routes and the elimination of unnecessary distances in any system. The Vehicle Routing Problem (VRP) is one of the practical co...
متن کاملCompetitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملScheduling of Multiple Autonomous Guided Vehicles for an Assembly Line Using Minimum Cost Network Flow
This paper proposed a parallel automated assembly line system to produce multiple products having multiple autonomous guided vehicles (AGVs). Several assembly lines are configured to produce multiple products in which the technologies of machines are shared among the assembly lines when required. The transportation between the stations in an assembly line (intra assembly line) and among station...
متن کاملModeling and Solving the Multi-depot Vehicle Routing Problem with Time Window by Considering the Flexible end Depot in Each Route
This paper considers the multi-depot vehicle routing problem with time window in which each vehicle starts from a depot and there is no need to return to its primary depot after serving customers. The mathematical model which is developed by new approach aims to minimizing the transportation cost including the travelled distance, the latest and the earliest arrival time penalties. Furthermore, ...
متن کامل